Query Optimization in OODBMS: Identifying Subquery for Query Management
نویسندگان
چکیده
منابع مشابه
Query Optimization in Oodbms: Identifying Subquery for Query Management
This paper is based on relatively newer approach for query optimization in object databases, which uses query decomposition and cached query results to improve execution a query. Issues that are focused here is fast retrieval and high reuse of cached queries, Decompose Query into Sub query, Decomposition of complex queries into smaller for fast retrieval of result. Here we try to address anothe...
متن کاملQuery Optimization in Oodbms: Identifying Subquery for Complex Query Management
This paper is based on relatively newer approach for query optimization in object databases, which uses query decomposition and cached query results to improve execution a query. Issues that are focused here is fast retrieval and high reuse of cached queries, Decompose Query into Sub query, Decomposition of complex queries into smaller for fast retrieval of result. Here we try to address anothe...
متن کاملQuery Optimization in an OODBMS
It is clearly crucial for the success of object-oriented databases to find effiĆ cient implementations that improve on the performance of relational sysĆ tems, rather than being powerful in terms of modeling and features, but just too slow to be used. This paper describes the mapping of COCOON to DASDBS, a nested relational database kernel system, as an example OODBMS mapping to a complex stora...
متن کاملSubquery Plan Reuse based Query Optimization
In this paper, we revisit the problem of query optimization in relational DBMS. We propose a scheme to reduce the search space of Dynamic Programming based on reuse of query plans among similar subqueries. The method generates the cover set of similar subgraphs present in the query graph and allows their corresponding subqueries to share query plans among themselves in the search space. Numerou...
متن کاملQuery-Subquery Nets
We formulate query-subquery nets and use them to create the first framework for developing algorithms for evaluating queries to Horn knowledge bases with the properties that: the approach is goal-directed; each subquery is processed only once and each supplement tuple, if desired, is transferred only once; operations are done set-at-a-time; and any control strategy can be used. Our intention is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Database Management Systems
سال: 2014
ISSN: 0975-5985,0975-5705
DOI: 10.5121/ijdms.2014.6204